On the Dispersions of the Gel'fand-Pinsker Channel and Dirty Paper Coding

Second-Order Rate of Constant-Composition Codes for the Gel'fand-Pinsker Channel

This paper presents an achievable second-order coding rate for the discrete memoryless Gel’fand-Pinkser channel. The result is obtained using constant-composition random coding, and by using an asymptotically negligible fraction of the block to transmit the type of the state sequence.

On joint source-channel coding for the Wyner-Ziv source and the Gel'fand-Pinsker channel

Joint Source-Channel Coding for the Arbitrarily Varying Wyner-Ziv Source and Gel'fand-Pinsker Channel

In this work we characterize the rate-distortion function of a Wyner-Ziv source, depending on an arbitrarily varying state, known non-causally at the encoder. We then consider the problem of joint source-channel coding of this source transmitted over an arbitrarily varying Gel’fand-Pinsker channel, where we assume that one jammer controls both, the source state sequence and the channel state se...

On Capacity of the Writing onto Fast Fading Dirt Channel

The classic Costa’s “writing on dirty paper” capacity result establishes that full state pre-cancellation can be attained in the Gel’fand-Pinsker channel with additive state and additive Gaussian noise. This result holds under the assumption that perfect channel knowledge is available at both transmitter and receiver: such an assumption is not valid in wireless scenarios affected by fading and ...

Achievable Secrecy Rate Regions of State Dependent Causal Cognitive Interference Channel

In this paper, the secrecy problem in the state dependent causal cognitive interference channel is studied. The channel state is non-causally known at the cognitive encoder. The message of the cognitive encoder must be kept secret from the primary receiver. We use a coding scheme which is a combination of compress-and-forward strategy with Marton coding, Gel’fand-Pinsker coding and Wyner’s wire...